Revisiting T. Uno and M. Yagiura's Algorithm
نویسندگان
چکیده
In 2000, T. Uno and M. Yagiura published an algorithm that computes all the K common intervals of two given permutations of length n in O(n + K) time. Our paper first presents a decomposition approach to obtain a compact encoding for common intervals of d permutations. Then, we revisit T. Uno and M. Yagiura’s algorithm to yield a linear time algorithm for finding this encoding. Besides, we adapt the algorithm to obtain a linear time modular decomposition of an undirected graph, and thereby propose a formal invariant-based proof for all these algorithms. B.-M. Bui Xuan [email protected] M. Habib [email protected] C. Paul [email protected]
منابع مشابه
Revisiting the Effects of Growth Uncertainty on Inflation in Iran:An Application of GARCH-in-Mean Models
This paper investigates the relationship between inflation and growth uncertainty in Iran for the period of 1988-2008 by using quarterly data. We employ Generalized Autoregressive Conditional Heteroscedasticity in Mean (GARCH-M) model to estimate time-varying conditional residual variance of growth, as a standard measures of growth uncertainty. The empirical evidence shows that growth uncertain...
متن کاملRecent studies on aerosols and ozone using lidars at NIES Japan
REFERENCES AND LINKS [1] N. Sugimoto, I. Matsui, A. Shimizu, T. Nishizawa, Y. Hara, C. Xie, I. Uno, K. Yumimoto, Z. Wang, S-C. Yoon, “Lidar network observations of troposheric aerosols”, Proc. SPIE Vol. 7153, Lidar Remote Sensing for Environmental Monitoring IX, 71530A (2008). [2] NIES lidar web site, http://www-lidar.nies.go.jp/ [3] J. Boesenberg, R. Hoff, “Plan for the implementation of the G...
متن کاملA New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It speeds enumeration algorithms for directed spanning trees, matroid bases, and some bipartite matching problems. We show one of these improved algorithms: one for enumerating matroid bases. For a given matroid M with m elements ...
متن کاملRevisiting the Nexus of FDI and Employment in International Trade: Evidence from the Emerging Construction Service Sector
T his study examines the relationship between Foreign Direct Investment (FDI) and employment in the Indonesia construction service sector. The method used in this study is Panel VECM Granger. The data used are the data of FDI inflow and employment in the construction sector in some provinces, namely North Sumatra, Riau, Jakarta, West Java, East Java, and...
متن کاملA New Approach for Speeding Up Enumeration Algorithms
We propose a new approach for speeding up enumeration algorithms. The approach does not relies on data structures deeply, but utilizes some analysis of its computation time. The enumeration algorithms for directed spanning trees, matroid bases, and some bipartite matching problems are speeded up by this approach. For a given graph G = (V,E), the time complexity of the algorithm for directed spa...
متن کامل